Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
1: |
|
f(x) |
→ s(x) |
2: |
|
f(s(s(x))) |
→ s(f(f(x))) |
|
There are 2 dependency pairs:
|
3: |
|
F(s(s(x))) |
→ F(f(x)) |
4: |
|
F(s(s(x))) |
→ F(x) |
|
Consider the SCC {3,4}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 3, 2006